A Comparative Study of Static and Pro le-Based Heuristics for Inlining
نویسندگان
چکیده
In this paper, we present a comparative study of static and proole-based heuristics for inlining. Our motivation for this study is to use the results to design the best inlining algorithm that we can for the Jalape~ no dynamic optimizing compiler for Java 6]. We use a well-known approximation algorithm for the knapsack problem as a common \meta-algorithm" for the inlining heuristics studied in this paper. We present performance results for an implementation of these inlining heuristics in the Jalape~ no dynamic optimizing compiler. Our performance results show that the inlining heuristics studied in this paper can lead to signiicant speedups in execution time (up to 1.68) even with modest limits on code size expansion (at most 10%).
منابع مشابه
Comparative Study of Static and Dynamic Heuristics for InliningMatthew
In this paper, we present a comparative study of static and dynamic heuristics for inlining. We introduce inlining plans as a formal representation for nested inlining decisions made by an inlining heuristic. We use a well-known approximation algorithm for the knapsack problem as a common \meta-algorithm" for the static and dynamic inlining heuristics studied in this paper. We present performan...
متن کاملAn Empirical Study of Method In-lining for a Java Just-in-Time Compiler
Method inlining is one of the optimizations that have a significant impact on both system performance and total compilation overhead in a dynamic compilation system. This paper describes an empirical study of onlineprofile-directed method inlining for obtaining both performance benefits and compilation time reductions in our dynamic compilation system. We rely solely on the profile information ...
متن کاملAutomatic WCET Reduction by Machine Learning Based Heuristics for Function Inlining
The application of machine learning techniques in compiler frameworks has become a challenging research area. Learning algorithms are exploited for an automatic generation of optimization heuristics which often outperform hand-crafted models. Moreover, these automatic approaches can effectively tune the compilers’ heuristics after larger changes in the optimization sequence or they can be lever...
متن کاملComparative Review of the Performance Based Design of Building Structures Using Static Non-Linear Analysis, Part A: Steel Braced Frames
The objective of this review to be submitted in two independent parts, for steel frames and for RC frames, is to compare their structural performance with respect to the proposed N2-method, and so also of the consequent convenience of using pushover methodology for the seismic analysis of these structures. A preliminary investigation is presented on a pushover analysis used for the seismic perf...
متن کاملDemand-driven Inlining in a Region-based Optimizer for ILP Architectures
Region-based compilation repartitions a program into more desirable compilation units using profiling information and procedure inlining to enable region formation analysis. Heuristics play a key role in determining when it is most beneficial to inline procedures during region formation. An ILP optimizing compiler using a region-based approach restructures a program to better reflect dynamic be...
متن کامل